A Semantic Normalization Proof for System T
نویسندگان
چکیده
Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extended to prove strong normalization results. For instance using the notion of super-consistency that is a semantic criterion for theories expressed in deduction modulo implying strong normalization. However, the strong normalization of System T has always been reluctant to such semantic methods. In this paper we give a semantic normalization proof of system T using the super consistency of some theory.
منابع مشابه
A Semantic Normalization Proof for Inductive Types
Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extended to prove strong normalization results. For instance using the notion of super-consistency that is a semantic criterion for theories expressed in deduction modulo implying strong normalization. However, the strong normalization of System T has always been reluctant...
متن کاملNew Notions of Reduction and Non-Semantic Proofs of -Strong Normalization in Typed -Calculi
Two new notions of reduction for terms of the -calculus are introduced and the question of whether a -term is -strongly normalizing is reduced to the question of whether a -term is merely normalizing under one of the new notions of reduction. This leads to a new way to prove -strong normalization for typed -calculi. Instead of the usual semantic proof style based on Girard's \candidats de r edu...
متن کاملA Semantic Proof that Reducibility Candidates entail Cut Elimination
Two main lines have been adopted to prove the cut elimination theorem: the syntactic one, that studies the process of reducing cuts, and the semantic one, that consists in interpreting a sequent in some algebra and extracting from this interpretation a cut-free proof of this very sequent. A link between those two methods was exhibited by studying in a semantic way, syntactical tools that allow ...
متن کاملConcurrency in Proof Normalization and Logic Programming
1 . In t roduct ion Proof normalization has a long history in mathematical logic [Prawitz 1965]. The significant result for computer science is as follows: // there is a proof of the formula 3z(A(z)), one can get an answer t, which satisfies A(t), after normalizing the proof. This realizes a computation, which is appropriately called logic programming. However, it is less efficient than Prolog....
متن کاملA semantic method to prove strong normalization from weak normalization (draft)
1 Minimal deduction modulo 1.1 Syntax We consider a set (T) of sorts, an infinite set of variables of each sort, a set (f) of function symbols, and a set (P) of predicate symbols, that come with their rank. The formation rules for objects and propositions are the usual ones. – Variables of sort T are terms of sort T. Propositions are built-up from atomic propositions with the usual connective ⇒...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008